Rule-Based Classification Based on Ant Colony Optimization: A Comprehensive Review
نویسندگان
چکیده
The Ant Colony Optimization (ACO) algorithms have been well-studied by the Operations Research community for solving combinatorial optimization problems. A handful of researchers in Data Science successfully implemented various ACO methodologies rule-based classification. This family is referred to as AntMiner algorithms. Due flexibility framework, and availability alternative strategies at modular level, a systematic review on can benefit broader practitioners interested highly interpretable classification techniques. In this paper, we provided comprehensive each module Our motivation provide insight into current practices future research scope context discussions address methodologies, rule construction strategies, candidate selection metrics, quality evaluation functions, pruning methods continuous attributes, parameter selection, experimental settings. also reports summary real-life implementations classifiers diverse domains including medical, genetics, portfolio analysis, geographic information system (GIS), human-machine interaction (HMI), autonomous driving, ICT, quality, reliability engineering. These demonstrate potential application that be benefitted from methodological contributions technique.
منابع مشابه
Classification Rule Discovery with Ant Colony Optimization
In [9], we presented a modified version of Ant-Miner (i.e. Ant-Miner2), where the core computation heuristic value was based on a simple density estimation heuristic. In this paper, we present a further study and introduce another ant-based algorithm, which uses a different pheromone updating strategy and state transition rule. By comparison with the work of Parpinelli et al, our method can imp...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملGradient-based Ant Colony Optimization for Continuous Spaces
A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...
متن کاملPopulation based ant colony optimization on FPGA
We propose to modify a type of ant algorithm called Population based Ant Colony Optimization (P-ACO) to allow implementation on an FPGA architecture. Ant algorithms are adapted from the natural behavior of ants and used to find good solutions to combinatorial optimization problems. General layout on the FPGA and algorithmic description are covered. The most notable achievements featured in this...
متن کاملA Study on Ant Colony Optimization with Association Rule
Ant miner is a data mining algorithm based on Ant Colony Optimization (ACO). Ant miner algorithms are mainly for discovery rule for optimization. Ant miner + algorithm uses MAX-MIN ant system for discover rules in the database. Soil classification deals with the systematic categorization of soils based on distinguished characteristics as well as criteria. The proposed model delivers to Ant mine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Computational Intelligence and Soft Computing
سال: 2022
ISSN: ['1687-9724', '1687-9732']
DOI: https://doi.org/10.1155/2022/2232000